An upper bound on the zero-error list-coding capacity
نویسندگان
چکیده
منابع مشابه
An upper bound on the zero-error list-coding capacity
We present an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list-3 capacity of the 4 /3 channel is at most 0.3512 b, improving the best previous bound. The relation of the bound to earlier similar bounds, in particular, to Korner’s graph-entropy bound, is discussed.
متن کاملAn Upper Bound on the Bayesian Error
In the Bayesian framework, predictions for a regression problem are expressed in terms of a distribution of output values. The mode of this distribution corresponds to the most probable output, while the uncertainty associated with the predictions can conveniently be expressed in terms of error bars. In this paper we consider the evaluation of error bars in the context of the class of generaliz...
متن کاملAn Upper Bound on the Error Probability of Capacity-Achieving Signaling on Broadband Rayleigh Fading Channels
We present an upper bound on the probability of error of a signaling scheme that achieves the capacity of the multipath fading channel under an average power constraint in the limit of infinite bandwidth. The bound is derived under the assumption of Rayleigh block fading. We are therefore able to determine the performance of the scheme when a given finite bandwidth is available. We evaluate the...
متن کاملAn Upper Bound for List T-colourings
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph or an odd cycle, ch(G) < A, where A is the maximum degree of a vertex in G and ch(G) is the choice number of the graph (also proved by Vizing in 1976). They also gave a characterisation of Z)-choosability. A graph G is Z)-choosable if, when we assign to each vertex u o f G a list containing d(v) ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1994
ISSN: 0018-9448
DOI: 10.1109/18.335947